Decomposition During Search
نویسندگان
چکیده
We describe decomposition during search (DDS) as a novel search algorithm for counting the solutions of a CSP. DDS enhances standard tree search by dynamically decomposing sub-problems into independent problems, avoiding redundant work. The paper provides formal definitions and analysis of the introduced method. We integrate DDS into a modern constraint programming system, using Gecode as an example. Two applications, graph coloring and protein structure prediction, show the potential for huge benefits of DDS in practice.
منابع مشابه
Symmetric Component Caching
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of efficiently combining these techniques with branch and bound for solving certain types of constraint optimization problems (COPs). Our new method significantly reduces the overhead of performing decomposition during search ...
متن کاملExploiting Decomposition on Constraint Problems with High Tree-Width
Decomposition is an effective technique for solving discrete Constraint Optimization Problems (COPs) with low tree-width. On problems with high treewidth, however, existing decomposition algorithms offer little advantage over branch and bound search (B&B). In this paper we propose a method for exploiting decomposition on problems with high treewidth. Our technique involves modifying B&B to dete...
متن کاملDynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go
Decomposition search is a divide and conquer approach that splits a game position into sub-positions and computes the global outcome by combining results of local searches. This approach has been shown to be successful to play endgames in the game of Go. This paper introduces dynamic decomposition search as a way of splitting a problem dynamically during search. Our results in solving one-eye p...
متن کاملDecomposition During Search for Propagation-Based Constraint Solvers
We describe decomposition during search (DDS), an integration of and/or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into independent partial problems, avoiding redundant work. The paper discusses how DDS interacts with key features that make propagation-based solvers successful: co...
متن کاملTowards a Dynamic Decomposition of CSPs with Separators of Bounded Size
In this paper, we address two key aspects of solving methods based on tree-decomposition. First, we propose an algorithm computing decompositions that allows to bound the size of separators, which is a crucial parameter to limit the space complexity, and thus the feasibility of such methods. Moreover, we show how it is possible to dynamically modify the considered decomposition during the searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007